Regular factors of simple regular graphs and factor-spectra

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Regular factors in regular graphs

Katerinis, P., Regular factors in regular graphs, Discrete Mathematics 113 (1993) 269-274. Let G be a k-regular, (k I)-edge-connected graph with an even number of vertices, and let m be an integer such that 1~ m s k 1. Then the graph obtained by removing any k m edges of G, has an m-factor. All graphs considered are finite. We shall allow graphs to contain multiple edges and we refer the reader...

متن کامل

Regular Factors of Regular Graphs from Eigenvalues

Let r and m be two integers such that r > m. Let H be a graph with order |H|, size e and maximum degree r such that 2e > |H|r−m. We find a best lower bound on spectral radius of graph H in terms of m and r. Let G be a connected r-regular graph of order |G| and k < r be an integer. Using the previous results, we find some best upper bounds (in terms of r and k) on the third largest eigenvalue th...

متن کامل

Regular Factors in Graphs

Diese Dissertation ist auf den Internetseiten der Hochschulbibliothek online verfügbar. Preface Many fields of mathematics are concerned with determining the smallest parts, or factors, of a certain kind, which make up a given object. Probably the best known examples in mathematics are the factorization of non-negative integers with prime numbers or the decomposition of polynomials. It was a pr...

متن کامل

Spectra of sparse regular graphs with loops

We derive exact equations that determine the spectra of undirected and directed sparsely connected regular graphs containing loops of arbitrary lengths. The implications of our results for the structural and dynamical properties of network models are discussed by showing how loops influence the size of the spectral gap and the propensity for synchronization. Analytical formulas for the spectrum...

متن کامل

The local spectra of regular line graphs

The local spectrum of a graph G = (V,E), constituted by the standard eigenvalues of G and their local multiplicities, plays a similar role as the global spectrum when the graph is “seen” from a given vertex. Thus, for each vertex i ∈ V , the i-local multiplicities of all the eigenvalues add up to 1; whereas the multiplicity of each eigenvalue λ of G is the sum, extended to all vertices, of its ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1998

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(97)00166-0